Guarded evaluation: pushing power management to logic synthesis/design
نویسندگان
چکیده
منابع مشابه
Guarded Evaluation : Pushing Power Managementto
The need to reduce the power consumption of the next generation of digital systems is clearly recognized. At the system level, power management is a very powerful technique and delivers large and unambiguous savings. This paper describes the development and application of algorithms that use ideas similar to power management, but that are applicable to logic level synthesis/design. The proposed...
متن کاملAccepted for Publication in the Ieee Transactions on Computer-aided Design Guarded Evaluation: Pushing Power Management to Logic Synthesis/design 1 Guarded Evaluation
The need to reduce the power consumption of the next generation of digital systems is clearly recognized at all levels of system design. At the system level, power management is a very powerful technique and delivers large and unambiguous savings. The ideas behind power management can be extended to the logic level. This would involve determining, which parts of a circuit are computing results ...
متن کاملGuarded Fixed Point Logic
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by Andréka, van Benthem and Németi. Guarded fixed point logics can also be viewed as the natural common extensions of the modal -calculus and the guarded fragments. We prove that the satisfiability problems for guarded fixed point logics ar...
متن کاملPushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contribution of the paper is an algorithm for propagating min and max predicates while preserving query equivalence under certain monotonicity constraints. We show that the algorithm is correct and that the transformed quer...
متن کاملFinite Satisfiability for Guarded Fixpoint Logic
The finite satisfiability problem for guarded fixpoint logic is decidable and complete for 2ExpTime (resp. ExpTime for formulas of bounded width).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
سال: 1998
ISSN: 0278-0070
DOI: 10.1109/43.728924